Character Kernels of Discrete Groups1
نویسنده
چکیده
Let G be an arbitrary discrete group and let T = C[G] be its group algebra over the complex numbers C. If 9? is an irreducible representation of the algebra then 9i(r)=P is primitive and hence isomorphic to a dense set of linear transformations over D, the commuting ring of 9J [4, p. 28]. Let L be the center of D. If dimr, P < °o then we say that 9? is finite and since P is central simple over A [4, p. 122] we have dinuP = ?ra2. We set rai = deg 9?, the degree of 9t If G is finite then C is always the commuting ring of 9i so this agrees with the usual definition of degree. Again let P = 9f(r). Then by a theorem of Amitsur [l] deg 9i^ra if and only if for every 2ra elements xi, • • • , x2n in P we have
منابع مشابه
Finite p-groups with few non-linear irreducible character kernels
Abstract. In this paper, we classify all of the finite p-groups with at most three non linear irreducible character kernels.
متن کاملKernels for Structured Natural Language Data
This paper devises a novel kernel function for structured natural language data. In the field of Natural Language Processing, feature extraction consists of the following two steps: (1) syntactically and semantically analyzing raw data, i.e., character strings, then representing the results as discrete structures, such as parse trees and dependency graphs with part-of-speech tags; (2) creating ...
متن کاملTransformation knowledge in pattern analysis with kernel methods: distance and integration kernels
Modern techniques for data analysis and machine learning are so called kernel methods. The most famous and successful one is represented by the support vector machine (SVM) for classification or regression tasks. Further examples are kernel principal component analysis for feature extraction or other linear classifiers like the kernel perceptron. The fundamental ingredient in these methods is t...
متن کاملProbit and nested logit models based on fuzzy measure
Inspired by the interactive discrete choice logit models [Aggarwal, 2019], this paper presents the advanced families of discrete choice models, such as nested logit, mixed logit, and probit models to consider the interaction among the attributes. Besides the DM's attitudinal character is also taken into consideration in the computation of choice probabilities. The proposed choice models make us...
متن کاملStudying Translationese at the Character Level
This paper presents a set of preliminary experiments which show that identifying translationese is possible with machine learning methods that work at character level, more precisely methods that use string kernels. But caution is necessary because string kernels very easily can introduce confounding factors.
متن کامل